package com.wfm.leetcode.editor.cn;

/**
 * 最小操作次数使数组元素相等
 * 2024-11-04 19:08:17
 */
class MinimumMovesToEqualArrayElements {

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int minMoves(int[] nums) {
        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) {
        Solution solution = new MinimumMovesToEqualArrayElements().new Solution();
        
    }
}